TSTP Solution File: SET684^3 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET684^3 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:55:18 EDT 2024
% Result : Theorem 0.22s 0.49s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 21 ( 6 unt; 7 typ; 0 def)
% Number of atoms : 34 ( 2 equ; 0 cnn)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 117 ( 11 ~; 15 |; 9 &; 80 @)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 28 ( 28 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 5 con; 0-4 aty)
% Number of variables : 26 ( 8 ^ 13 !; 5 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_43,type,
rel_composition: ( $i > $i > $o ) > ( $i > $i > $o ) > $i > $i > $o ).
thf(decl_57,type,
epred1_0: $i > $i > $o ).
thf(decl_58,type,
epred2_0: $i > $i > $o ).
thf(decl_59,type,
esk1_0: $i ).
thf(decl_60,type,
esk2_0: $i ).
thf(decl_61,type,
esk3_0: $i ).
thf(decl_62,type,
esk4_0: $i ).
thf(rel_composition,axiom,
( rel_composition
= ( ^ [X26: $i > $i > $o,X27: $i > $i > $o,X1: $i,X31: $i] :
? [X3: $i] :
( ( X26 @ X1 @ X3 )
& ( X27 @ X3 @ X31 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET008^2.ax',rel_composition) ).
thf(thm,conjecture,
! [X36: $i > $i > $o,X28: $i > $i > $o,X1: $i,X31: $i] :
( ( rel_composition @ X36 @ X28 @ X1 @ X31 )
<=> ? [X3: $i] :
( ( X36 @ X1 @ X3 )
& ( X28 @ X3 @ X31 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thm) ).
thf(c_0_2,plain,
( rel_composition
= ( ^ [Z0: $i > $i > $o,Z1: $i > $i > $o,Z2: $i,Z3: $i] :
? [X3: $i] :
( ( Z0 @ Z2 @ X3 )
& ( Z1 @ X3 @ Z3 ) ) ) ),
inference(fof_simplification,[status(thm)],[rel_composition]) ).
thf(c_0_3,negated_conjecture,
~ ! [X36: $i > $i > $o,X28: $i > $i > $o,X1: $i,X31: $i] :
( ? [X42: $i] :
( ( X36 @ X1 @ X42 )
& ( X28 @ X42 @ X31 ) )
<=> ? [X3: $i] :
( ( X36 @ X1 @ X3 )
& ( X28 @ X3 @ X31 ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]),c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X47: $i,X48: $i] :
( ( ~ ( epred1_0 @ esk1_0 @ X47 )
| ~ ( epred2_0 @ X47 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ X48 )
| ~ ( epred2_0 @ X48 @ esk2_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 ) )
& ( ( epred2_0 @ esk4_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 ) )
& ( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred2_0 @ esk3_0 @ esk2_0 ) )
& ( ( epred2_0 @ esk4_0 @ esk2_0 )
| ( epred2_0 @ esk3_0 @ esk2_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
thf(c_0_5,negated_conjecture,
! [X1: $i,X3: $i] :
( ~ ( epred1_0 @ esk1_0 @ X1 )
| ~ ( epred2_0 @ X1 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 )
| ~ ( epred2_0 @ X3 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_6,negated_conjecture,
! [X1: $i] :
( ~ ( epred2_0 @ X1 @ esk2_0 )
| ~ ( epred1_0 @ esk1_0 @ X1 ) ),
inference(condense,[status(thm)],[c_0_5]) ).
thf(c_0_7,negated_conjecture,
( ( epred2_0 @ esk4_0 @ esk2_0 )
| ( epred2_0 @ esk3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_8,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred2_0 @ esk3_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_9,negated_conjecture,
( ( epred2_0 @ esk4_0 @ esk2_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_10,negated_conjecture,
( ( epred1_0 @ esk1_0 @ esk4_0 )
| ( epred1_0 @ esk1_0 @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_11,negated_conjecture,
epred2_0 @ esk3_0 @ esk2_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_12,negated_conjecture,
epred1_0 @ esk1_0 @ esk3_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET684^3 : TPTP v8.2.0. Released v3.6.0.
% 0.12/0.13 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n011.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 12:47:53 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.22/0.47 Running higher-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.49 # Version: 3.1.0-ho
% 0.22/0.49 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.49 # Starting new_bool_2 with 300s (1) cores
% 0.22/0.49 # sh5l with pid 19004 completed with status 0
% 0.22/0.49 # Result found by sh5l
% 0.22/0.49 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49 # Search class: HGHNF-FFSS00-SHSSMFNN
% 0.22/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.49 # new_ho_10 with pid 19009 completed with status 0
% 0.22/0.49 # Result found by new_ho_10
% 0.22/0.49 # Preprocessing class: HSMSSMSSMLSNHSA.
% 0.22/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.49 # Starting new_ho_10 with 1500s (5) cores
% 0.22/0.49 # Starting sh5l with 300s (1) cores
% 0.22/0.49 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.49 # Search class: HGHNF-FFSS00-SHSSMFNN
% 0.22/0.49 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.49 # Starting new_ho_10 with 181s (1) cores
% 0.22/0.49 # Preprocessing time : 0.001 s
% 0.22/0.49 # Presaturation interreduction done
% 0.22/0.49
% 0.22/0.49 # Proof found!
% 0.22/0.49 # SZS status Theorem
% 0.22/0.49 # SZS output start CNFRefutation
% See solution above
% 0.22/0.49 # Parsed axioms : 71
% 0.22/0.49 # Removed by relevancy pruning/SinE : 69
% 0.22/0.49 # Initial clauses : 5
% 0.22/0.49 # Removed in clause preprocessing : 0
% 0.22/0.49 # Initial clauses in saturation : 5
% 0.22/0.49 # Processed clauses : 12
% 0.22/0.49 # ...of these trivial : 0
% 0.22/0.49 # ...subsumed : 0
% 0.22/0.49 # ...remaining for further processing : 12
% 0.22/0.49 # Other redundant clauses eliminated : 0
% 0.22/0.49 # Clauses deleted for lack of memory : 0
% 0.22/0.49 # Backward-subsumed : 1
% 0.22/0.49 # Backward-rewritten : 3
% 0.22/0.49 # Generated clauses : 4
% 0.22/0.49 # ...of the previous two non-redundant : 3
% 0.22/0.49 # ...aggressively subsumed : 0
% 0.22/0.49 # Contextual simplify-reflections : 2
% 0.22/0.49 # Paramodulations : 4
% 0.22/0.49 # Factorizations : 0
% 0.22/0.49 # NegExts : 0
% 0.22/0.49 # Equation resolutions : 0
% 0.22/0.49 # Disequality decompositions : 0
% 0.22/0.49 # Total rewrite steps : 4
% 0.22/0.49 # ...of those cached : 2
% 0.22/0.49 # Propositional unsat checks : 0
% 0.22/0.49 # Propositional check models : 0
% 0.22/0.49 # Propositional check unsatisfiable : 0
% 0.22/0.49 # Propositional clauses : 0
% 0.22/0.49 # Propositional clauses after purity: 0
% 0.22/0.49 # Propositional unsat core size : 0
% 0.22/0.49 # Propositional preprocessing time : 0.000
% 0.22/0.49 # Propositional encoding time : 0.000
% 0.22/0.49 # Propositional solver time : 0.000
% 0.22/0.49 # Success case prop preproc time : 0.000
% 0.22/0.49 # Success case prop encoding time : 0.000
% 0.22/0.49 # Success case prop solver time : 0.000
% 0.22/0.49 # Current number of processed clauses : 3
% 0.22/0.49 # Positive orientable unit clauses : 2
% 0.22/0.49 # Positive unorientable unit clauses: 0
% 0.22/0.49 # Negative unit clauses : 0
% 0.22/0.49 # Non-unit-clauses : 1
% 0.22/0.49 # Current number of unprocessed clauses: 1
% 0.22/0.49 # ...number of literals in the above : 2
% 0.22/0.49 # Current number of archived formulas : 0
% 0.22/0.49 # Current number of archived clauses : 9
% 0.22/0.49 # Clause-clause subsumption calls (NU) : 7
% 0.22/0.49 # Rec. Clause-clause subsumption calls : 7
% 0.22/0.49 # Non-unit clause-clause subsumptions : 3
% 0.22/0.49 # Unit Clause-clause subsumption calls : 2
% 0.22/0.49 # Rewrite failures with RHS unbound : 0
% 0.22/0.49 # BW rewrite match attempts : 2
% 0.22/0.49 # BW rewrite match successes : 2
% 0.22/0.49 # Condensation attempts : 12
% 0.22/0.49 # Condensation successes : 1
% 0.22/0.49 # Termbank termtop insertions : 918
% 0.22/0.49 # Search garbage collected termcells : 484
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.003 s
% 0.22/0.49 # System time : 0.001 s
% 0.22/0.49 # Total time : 0.005 s
% 0.22/0.49 # Maximum resident set size: 1940 pages
% 0.22/0.49
% 0.22/0.49 # -------------------------------------------------
% 0.22/0.49 # User time : 0.004 s
% 0.22/0.49 # System time : 0.005 s
% 0.22/0.49 # Total time : 0.009 s
% 0.22/0.49 # Maximum resident set size: 1812 pages
% 0.22/0.49 % E---3.1 exiting
% 0.22/0.49 % E exiting
%------------------------------------------------------------------------------